package stmo.树.堆;

public class Test <T extends Comparable<T>>{

    private T[] item;

    private int N;

    public Test(int ca) {
        this.item =(T[]) new Comparable[ca + 1];
        this.N = 0;
    }

    private boolean less(int i,int t) {
        return item[i].compareTo(item[t]) < 0;
    }

}
